Abstracting runtime heaps for program understanding
نویسندگان
چکیده
منابع مشابه
From Structured Heaps to Encapsulated Runtime Components
In OO-modeling and programming, state is structured into a set of objects. Objects can reference each other forming a graph with objects as nodes and references as edges. During the execution of object systems, the graph structure changes when objects are created or references are stored. As objects can access other objects only by following references, means to control the graph structure are ...
متن کاملRuntime Checking for Program Verification
The process of verifying that a program conforms to its specification is often hampered by errors in both the program and the specification. A runtime checker that can evaluate formal specifications can be useful for quickly identifying such errors. This paper describes our preliminary experience with incorporating run-time checking into the Jahob verification system and discusses some lessons ...
متن کاملUnderstanding and Abstracting Total Data Center Power
The alarming growth of data center power consumption has led to a surge in research activity on data center energy efficiency. Though myriad, most existing energy-efficiency efforts focus narrowly on a single data center subsystem. Sophisticated power management increases dynamic power ranges and can lead to complex interactions among IT, power, and cooling systems. However, reasoning about tot...
متن کاملRuntime Checking for Program Verification Systems
One of the goals of program verification is to show that a program conforms to a specification written in a formal logic. Oftentimes, this process is hampered by errors in both the program and the specification. The time spent in identifying and eliminating these errors can even dominate the final verification effort. A runtime checker that can evaluate formal specifications can be extremely us...
متن کاملThe Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
We develop a static analysis which distills first-order computational structure from higher-order functional programs. The analysis condenses higher-order programs into a first-order rule-based system, a nugget, that characterizes all value bindings that may arise from program execution. Theorem provers are limited in their ability to automatically reason about higher-order programs; nuggets ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2013
ISSN: 0098-5589,1939-3520
DOI: 10.1109/tse.2012.69